/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package projecteuler2;

import java.util.*;
/**
 *sdfsdf
 * @author Paul Mallon
 */
public class Problems {
  

    public void problem6(){

        /*
         * The sum of the squares of the first ten natural numbers is,1^2 + 2^2 + ... + 10^2 = 385
         * The square of the sum of the first ten natural numbers is,(1 + 2 + ... + 10)2 = 552 = 3025
         * Hence the difference between the sum of the squares of the first ten natural numbers and the 
         * square of the sum is 3025  385 = 2640.
         * Find the difference between the sum of the squares of the first one hundred natural numbers and 
         * the square of the sum.
         */
//dsfsdfds
        int sumOfSquare = 0;
        int squareOfSum = 0;
        int difference = 0;
                
        for(int x = 0; x < 101; x++){
        
            sumOfSquare += (x * x);
            squareOfSum += x;
        }
        
        squareOfSum = squareOfSum * squareOfSum;
        difference = squareOfSum - sumOfSquare;
        
        System.out.println(difference);
    }   
    
    public void problem4(){
    
        /*
         * Find the largest palendrome that is the product of two three digit numbers
         */
        int firstNumber = 0;
        int secondNumber = 0;
        int answer = 0;
        int largestPalendrome = 0;
        boolean palendrome = true;
        
        for(int x = 100; x < 1000; x++){
            
            firstNumber = x;
            
            for(int y = 100; y < 1000; y++){
        
                secondNumber = y;
                answer = firstNumber * secondNumber;
                String answerString = Integer.toString(answer);
                palendrome = true;
                int z2 = answerString.length() - 1;
                int z3 = 0;
                do{
                            
                    char test1[] =  answerString.toCharArray();
                    char test2[] =  answerString.toCharArray();
                
                    if(test1[z2] == test2[z3]){
                        
                        z3++;
                        z2--;

                    }else{
                            
                        palendrome = false;
                                
                    }
                        
                }while(palendrome == true && z2 < answerString.length()-1 && 
                       z3 < answerString.length()-1);
                        
                    if(palendrome == true && answer > largestPalendrome){
                        
                        largestPalendrome = answer;
                        z3 = 0;
                    }
                }     
        }
        
        System.out.println("The largest Palendrome made of the product of two "
                            + "three digit numbers is: " + largestPalendrome);
    
    }
    
    public void problem4v2(){
    
        /*
         * Find the largest palendrome that is the product of two three digit numbers
         */
        int firstNumber = 0;
        int secondNumber = 0;
        int answer = 0;
        int largestPalendrome = 0;
        boolean palendrome = true;
        
        for(int x = 100; x < 1000; x++){
            
            firstNumber = x;
            
            for(int y = 100; y < 1000; y++){
        
                secondNumber = y;
                answer = firstNumber * secondNumber;
                String answerString = Integer.toString(answer);
                palendrome = true;
                int z2 = answerString.length() - 1;
                int z3 = 0;
                do{
                            
                    char test1[] =  answerString.toCharArray();
                    char test2[] =  answerString.toCharArray();
                
                    if(test1[z2] == test2[z3]){
                        
                        z3++;
                        z2--;

                    }else{
                            
                        palendrome = false;
                                
                    }
                        
                }while(palendrome == true && z2 < answerString.length()-1 && 
                       z3 < answerString.length()-1);
                        
                    if(palendrome == true && answer > largestPalendrome){
                        
                        largestPalendrome = answer;
                        z3 = 0;
                    }
                }     
        }
        
        System.out.println("The largest Palendrome made of the product of two "
                            + "three digit numbers is: " + largestPalendrome);
    
    }
    
    public void problem5(){
        
        /*
         * 2520 is the smallest number that can be divided by each of the numbers 
         * from 1 to 10 without any remainder.What is the smallest positive number 
         * that is evenly divisible by all of the numbers from 1 to 20?
         * 
         * consider:
         * 20 = 2, 4, 5, 10, 20
         * 18 = 2, 3, 6, 9 
         * 17 = 17
         * 16 = 2, 4, 8
         * 15 = 3, 5
         * 14 = 2, 7
         * 13 = 13
         * 12 = 2, 3, 6, 12
         * 11 = 11
         * 
         */
        
        int dividers[] = {20, 19, 18, 17, 16, 15, 14, 13, 12, 11}; // array.length() == 10
        int lowestDenominatorTest = (20 * 19 * 18 * 17 * 16 * 15 * 14 * 13 * 12 * 11);
        int lowestDenominator = 0;
        //System.out.println("initial value: " + lowestDenominatorTest);
        
        for(int x = 0; x < dividers[0]; x++){
        
            lowestDenominatorTest -=1;
            if(lowestDenominatorTest % dividers[0] == 0) break;
        }
       // System.out.println("first number divisable by 20: " + lowestDenominatorTest);
        
        while(lowestDenominatorTest % dividers[0] == 0 && lowestDenominatorTest > 0){
            //System.out.println("Testing: " + lowestDenominatorTest);
            if(lowestDenominatorTest % dividers[0] == 0 &&
               lowestDenominatorTest % dividers[1] == 0 && 
               lowestDenominatorTest % dividers[2] == 0 && 
               lowestDenominatorTest % dividers[3] == 0 && 
               lowestDenominatorTest % dividers[4] == 0 && 
               lowestDenominatorTest % dividers[5] == 0 && 
               lowestDenominatorTest % dividers[6] == 0 && 
               lowestDenominatorTest % dividers[7] == 0 && 
               lowestDenominatorTest % dividers[8] == 0 && 
               lowestDenominatorTest % dividers[9] == 0){
            
                lowestDenominator = lowestDenominatorTest;
                lowestDenominatorTest = dividers[0] * ((lowestDenominatorTest / dividers[0]) - 1);
                
            }else{
                
                lowestDenominatorTest = dividers[0] * ((lowestDenominatorTest / dividers[0]) - 1);
            }
        
        }
        
        System.out.println("The lowest Denominator is: " + lowestDenominator);
        for(int x = 1; x < 21; x++){
        
            System.out.println( lowestDenominator + " divided by " + x + " has a remainder of " + (lowestDenominator % x));
        
        }
    }
    
    public void problem13(){
        /*
         * Work out the first ten digits of the sum of the following one-hundred 50-digit numbers.
         */
        double bigNumbers[] = new double[101];
        bigNumbers[1] = 37107287533902102798797998220837590246510135740250d;
        bigNumbers[2] = 46376937677490009712648124896970078050417018260538d;
        bigNumbers[3] = 74324986199524741059474233309513058123726617309629d;
        bigNumbers[4] = 91942213363574161572522430563301811072406154908250d;
        bigNumbers[5] = 23067588207539346171171980310421047513778063246676d;
        bigNumbers[6] = 89261670696623633820136378418383684178734361726757d;
        bigNumbers[7] = 28112879812849979408065481931592621691275889832738d;
        bigNumbers[8] = 44274228917432520321923589422876796487670272189318d;
        bigNumbers[9] = 47451445736001306439091167216856844588711603153276d;
        bigNumbers[10] = 70386486105843025439939619828917593665686757934951d;
        bigNumbers[11] = 62176457141856560629502157223196586755079324193331d;
        bigNumbers[12] = 64906352462741904929101432445813822663347944758178d;
        bigNumbers[13] = 92575867718337217661963751590579239728245598838407d;
        bigNumbers[14] = 58203565325359399008402633568948830189458628227828d;
        bigNumbers[15] = 80181199384826282014278194139940567587151170094390d;
        bigNumbers[16] = 35398664372827112653829987240784473053190104293586d;
        bigNumbers[17] = 86515506006295864861532075273371959191420517255829d;
        bigNumbers[18] = 71693888707715466499115593487603532921714970056938d;
        bigNumbers[19] = 54370070576826684624621495650076471787294438377604d;
        bigNumbers[20] = 53282654108756828443191190634694037855217779295145d;
        bigNumbers[21] = 36123272525000296071075082563815656710885258350721d;
        bigNumbers[22] = 45876576172410976447339110607218265236877223636045d;
        bigNumbers[23] = 17423706905851860660448207621209813287860733969412d;
        bigNumbers[24] = 81142660418086830619328460811191061556940512689692d;
        bigNumbers[25] = 51934325451728388641918047049293215058642563049483d;
        bigNumbers[26] = 62467221648435076201727918039944693004732956340691d;
        bigNumbers[27] = 15732444386908125794514089057706229429197107928209d;
        bigNumbers[28] = 55037687525678773091862540744969844508330393682126d;
        bigNumbers[29] = 18336384825330154686196124348767681297534375946515d;
        bigNumbers[30] = 80386287592878490201521685554828717201219257766954d;
        bigNumbers[31] = 78182833757993103614740356856449095527097864797581d;
        bigNumbers[32] = 16726320100436897842553539920931837441497806860984d;
        bigNumbers[33] = 48403098129077791799088218795327364475675590848030d;
        bigNumbers[34] = 87086987551392711854517078544161852424320693150332d;
        bigNumbers[35] = 59959406895756536782107074926966537676326235447210d;
        bigNumbers[36] = 69793950679652694742597709739166693763042633987085d;
        bigNumbers[37] = 41052684708299085211399427365734116182760315001271d;
        bigNumbers[38] = 65378607361501080857009149939512557028198746004375d;
        bigNumbers[39] = 35829035317434717326932123578154982629742552737307d;
        bigNumbers[40] = 94953759765105305946966067683156574377167401875275d;
        bigNumbers[41] = 88902802571733229619176668713819931811048770190271d;
        bigNumbers[42] = 25267680276078003013678680992525463401061632866526d;
        bigNumbers[43] = 36270218540497705585629946580636237993140746255962d;
        bigNumbers[44] = 24074486908231174977792365466257246923322810917141d;
        bigNumbers[45] = 91430288197103288597806669760892938638285025333403d;
        bigNumbers[46] = 34413065578016127815921815005561868836468420090470d;
        bigNumbers[47] = 23053081172816430487623791969842487255036638784583d;
        bigNumbers[48] = 11487696932154902810424020138335124462181441773470d;
        bigNumbers[49] = 63783299490636259666498587618221225225512486764533d;
        bigNumbers[50] = 67720186971698544312419572409913959008952310058822d;
        bigNumbers[51] = 95548255300263520781532296796249481641953868218774d;
        bigNumbers[52] = 76085327132285723110424803456124867697064507995236d;
        bigNumbers[53] = 37774242535411291684276865538926205024910326572967d;
        bigNumbers[54] = 23701913275725675285653248258265463092207058596522d;
        bigNumbers[55] = 29798860272258331913126375147341994889534765745501d;
        bigNumbers[56] = 18495701454879288984856827726077713721403798879715d;
        bigNumbers[57] = 38298203783031473527721580348144513491373226651381d;
        bigNumbers[58] = 34829543829199918180278916522431027392251122869539d;
        bigNumbers[59] = 40957953066405232632538044100059654939159879593635d;
        bigNumbers[60] = 29746152185502371307642255121183693803580388584903d;
        bigNumbers[61] = 41698116222072977186158236678424689157993532961922d;
        bigNumbers[62] = 62467957194401269043877107275048102390895523597457d;
        bigNumbers[63] = 23189706772547915061505504953922979530901129967519d;
        bigNumbers[64] = 86188088225875314529584099251203829009407770775672d;
        bigNumbers[65] = 11306739708304724483816533873502340845647058077308d;
        bigNumbers[66] = 82959174767140363198008187129011875491310547126581d;
        bigNumbers[67] = 97623331044818386269515456334926366572897563400500d;
        bigNumbers[68] = 42846280183517070527831839425882145521227251250327d;
        bigNumbers[69] = 55121603546981200581762165212827652751691296897789d;
        bigNumbers[70] = 32238195734329339946437501907836945765883352399886d;
        bigNumbers[71] = 75506164965184775180738168837861091527357929701337d;
        bigNumbers[72] = 62177842752192623401942399639168044983993173312731d;
        bigNumbers[73] = 32924185707147349566916674687634660915035914677504d;
        bigNumbers[74] = 99518671430235219628894890102423325116913619626622d;
        bigNumbers[75] = 73267460800591547471830798392868535206946944540724d;
        bigNumbers[76] = 76841822524674417161514036427982273348055556214818d;
        bigNumbers[77] = 97142617910342598647204516893989422179826088076852d;
        bigNumbers[78] = 87783646182799346313767754307809363333018982642090d;
        bigNumbers[79] = 10848802521674670883215120185883543223812876952786d;
        bigNumbers[80] = 71329612474782464538636993009049310363619763878039d;
        bigNumbers[81] = 62184073572399794223406235393808339651327408011116d;
        bigNumbers[82] = 66627891981488087797941876876144230030984490851411d;
        bigNumbers[83] = 60661826293682836764744779239180335110989069790714d;
        bigNumbers[84] = 85786944089552990653640447425576083659976645795096d;
        bigNumbers[85] = 66024396409905389607120198219976047599490197230297d;
        bigNumbers[86] = 64913982680032973156037120041377903785566085089252d;
        bigNumbers[87] = 16730939319872750275468906903707539413042652315011d;
        bigNumbers[88] = 94809377245048795150954100921645863754710598436791d;
        bigNumbers[89] = 78639167021187492431995700641917969777599028300699d;
        bigNumbers[90] = 15368713711936614952811305876380278410754449733078d;
        bigNumbers[91] = 40789923115535562561142322423255033685442488917353d;
        bigNumbers[92] = 44889911501440648020369068063960672322193204149535d;
        bigNumbers[93] = 41503128880339536053299340368006977710650566631954d;
        bigNumbers[94] = 81234880673210146739058568557934581403627822703280d;
        bigNumbers[95] = 82616570773948327592232845941706525094512325230608d;
        bigNumbers[96] = 22918802058777319719839450180888072429661980811197d;
        bigNumbers[97] = 77158542502016545090413245809786882778948721859617d;
        bigNumbers[98] = 72107838435069186155435662884062257473692284509516d;
        bigNumbers[99] = 20849603980134001723930671666823555245252804609722d;
        bigNumbers[100] = 53503534226472524250874054075591789781264330331690d;

        for(int  i = 1; i < bigNumbers.length; i++){
        
        
            bigNumbers[0] += bigNumbers[i];
            
            System.out.println("sum is " + bigNumbers[0]);

        }        
            double test = bigNumbers[0];
            System.out.println("test sum is " + test);
        String biggestNumberString =  Double.toString(bigNumbers[0]);
        String answer = "";
        for(int  i = 0; i < 11; i++){
            
            char char1 = biggestNumberString.charAt(i);
            String stop = ".";
            if(char1 != stop.charAt(0))System.out.println("Char " + i + " is " + char1);
           
        }
    }
    
    public void problem10(){
        /*
         * calculate the sum of all primes below 2,000,000
         * Need to re-do this, takes way too long, currently around 12 minutes without
         * System.messages.
         */
        double testNumber = 24;
        double answer = 100;
        double x = 2;

        while(testNumber < 2000000){

            if(testNumber % x == 0 && testNumber != x){

                testNumber ++;

                x = 2;

            }else if(testNumber % x == 0 && testNumber == x){

                //System.out.println("Prime added: " + testNumber);
                answer += testNumber;
                testNumber ++;
                x=2;
                //System.out.println("Current answer = " + answer);

            }else{

                x++;

            }

        }

        System.out.println("the answer to question 10 is: " + answer);


    }
    
    public void problem9(){
    /*
     * A Pythagorean triplet is a set of three natural numbers, a < b < c, for which, 
     *      a^2 + b^2 = c^2
     * For example, 32 + 42 = 9 + 16 = 25 = 5^2
     * There exists exactly one Pythagorean triplet for which a + b + c = 1000.
     * Find the product abc.
     */     
    int a = 0;
    int b = 0;
    int c = 0;
    boolean foundResult = false;
    while(!foundResult){
    for(int x = 1000; x > 2; x--){
        c = x;
        for(int y = 999; y > 1; y--){
            b = y;
            for(int z = y - 1; z > 0; z--){
                a = z;
                if(((a*a)+(b*b) == (c*c)) && (a + b + c == 1000)){
    
                     System.out.println("The a + b + c  is " + a + " + " + b +
                                        " + " + c);
                     System.out.println("The answer is " + a*b*c);
                     foundResult = true;
                }                      
            }    
        }
    }
    
    System.out.println("Program Finished");
    foundResult = true;
    }
    }
    
    public void problem8(){
    
    /*
     * Find the greatest product of five consecutive digits in the 1000-digit number.
     */
        
    String theBigOne =  "73167176531330624919225119674426574742355349194934"+
                        "96983520312774506326239578318016984801869478851843"+
                        "85861560789112949495459501737958331952853208805511"+
                        "12540698747158523863050715693290963295227443043557"+
                        "66896648950445244523161731856403098711121722383113"+
                        "62229893423380308135336276614282806444486645238749"+
                        "30358907296290491560440772390713810515859307960866"+
                        "70172427121883998797908792274921901699720888093776"+
                        "65727333001053367881220235421809751254540594752243"+
                        "52584907711670556013604839586446706324415722155397"+
                        "53697817977846174064955149290862569321978468622482"+
                        "83972241375657056057490261407972968652414535100474"+
                        "82166370484403199890008895243450658541227588666881"+
                        "16427171479924442928230863465674813919123162824586"+
                        "17866458359124566529476545682848912883142607690042"+
                        "24219022671055626321111109370544217506941658960408"+
                        "07198403850962455444362981230987879927244284909188"+
                        "84580156166097919133875499200524063689912560717606"+
                        "05886116467109405077541002256983155200055935729725"+
                        "71636269561882670428252483600823257530420752963450";

    long answer = 0;
    
    for(int x = 0; x < theBigOne.length()- 5; x++){
        
        long test1 = 1;
        long test2 = 1;
    
        for(int y = x; y < x+5; y++){
        
            String test1S = String.valueOf(theBigOne.charAt(y));
            int i1 = Integer.decode(test1S);
            test1 *= i1;
            String test2S =String.valueOf(theBigOne.charAt(y + 1));
            int i2 = Integer.decode(test2S);
            test2 *= i2;
        
        }
    
        if(test1 > test2){
        
            if(test1 > answer)answer = test1;
        
        }else if(test2 > test1){
        
            if(test2 > answer)answer = test2;
            
        }

    }
    System.out.println("The answer is: " + answer);
    }
    
    public void problem16(){
        /*
         * 215 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26.
         * What is the sum of the digits of the number 2^1000?
         * 
         * crashes due to my inability to properly convert double to a string
         */
        int answer = 0;
        double twoToThousand = 2;
        
        for(int x = 1; x < 1001; x++){
            
            twoToThousand *= 2;
            System.out.println("The square is: " + twoToThousand);
        
        }
        
        String result = Double.toString(twoToThousand);
        String y;
        for(int x = 0; x < 17; x++){
        y = String.valueOf(result.charAt(x));    
        if(result.charAt(x) != '.')answer += Integer.decode(y);  
    
       }
        System.out.println("The answer is: " + answer);
    }
    
    public void problem17(){
    
    int one = 3;
    int two = 3;
    int three = 5;
    int four = 4;
    int five = 4;
    int six = 3;
    int seven = 5;
    int eight = 5;
    int nine = 4;
    int ten = 3;
    int twenty = 6;
    int thirty = 6;
    int fourty = 6;
    int fifty = 5;
    int sixty = 5;
    int seventy = 7;
    int eighty = 6;
    int ninety = 6;
    int hundred = 7;
    int and = 3;
    int digitCount = 11;
    int currentNumber = 1;
    
    while(currentNumber < 1000){
        String converted = String.valueOf(currentNumber);
        int [] numberAnalysis = new int[converted.length()];
        
        for(int x = converted.length(); x > 0; x--){

            numberAnalysis[x-1] = Integer.parseInt(String.valueOf(converted.charAt(x-1)));
        
        }
    
        switch(numberAnalysis.length){
        
            case 3:
                
            case 2:
                
            case 1:
        
        
        }
    }
    
    }
    public static void subversionTest(){
    
       System.out.println("This message is just a test for subversion!!!");
       for(int x = 0; x < 11; x++){
           
           System.out.println(x);
           System.out.println(x);
       }
    }
}


